Using Strictness Information in the STG{machine
نویسنده
چکیده
The paper presents an attempt at exploiting strictness information for parallel evaluation of functional programs. A simple evaluation model, which uses strictness in a limited way, is suggested. It has been applied in a parallel version of the STG{machine; special attention has been paid to avoiding the creation of useless tasks. Some results from the simulation of the parallel STG{machine are provided, throwing light on the amount and granularity of parallelism.
منابع مشابه
Eecient Strictness Analysis of Haskell in Haskell Using Abstract Reduction
The extraction of strictness information marks an indispensable element of an eecient compilation of lazy functional languages like Haskell. Based on the method of abstract reduction we have developed an eecient strictness analyser for a core language of Haskell. It is completely written in Haskell and compares favourably with known implementations. The implementation is based on the G #-machin...
متن کاملThe Role of Corporate Governance Mechanisms and the Auditor's Specialty in Debt Contract Strictness
Objective: Violation of contractual conditions leads to the transmission of bad news due to poor performance and the expertise of auditors and regulatory mechanisms can be a factor in adjusting it. In this article, the purpose is to examine the role of strictness in the debt contract and the auditor's expertise. Research Method: In order to study the subject based on the logistic regression mo...
متن کاملFrom natural semantics to C: A formal derivation of two STG machines
The Spineless Tag-less G-machine (STG machine) was defined as the target abstract machine for compiling the lazy functional language Haskell. It is at the heart of the Glasgow Haskell Compiler (GHC) which is claimed to be the Haskell compiler that generates the most efficient code. A high-level description of the STG machine can be found at (Peyton Jones, 1992; Marlow & Peyton Jones, 2004; Marl...
متن کاملDeriving a Strongly Normalizing STG Machine
We present a modified version of the spineless tagless graph machine (or STG machine for short), that can deal with free variables and makes it possible to use compiled code for the normalization of functional expressions. We derive the machine from a high level semantics, thus enabling a simple correctness proof. Our modified STG machine has been successfully implemented in the Ulysses system.
متن کاملUsing Machine Learning Algorithms for Automatic Cyber Bullying Detection in Arabic Social Media
Social media allows people interact to express their thoughts or feelings about different subjects. However, some of users may write offensive twits to other via social media which known as cyber bullying. Successful prevention depends on automatically detecting malicious messages. Automatic detection of bullying in the text of social media by analyzing the text "twits" via one of the machine l...
متن کامل